Hamiltonian cycles passing through linear forests in k-ary n-cubes
نویسندگان
چکیده
منابع مشابه
Mutually independent Hamiltonian cycles in k-ary n-cubes when k is even
The k-ary n-cubes, Qn, is one of the most well-known interconnection networks in parallel computers. Let n ≥ 1 be an integer and k ≥ 3 be an odd integer. It has been shown that any Qn is a 2n-regular, vertex symmetric and edge symmetric graph with a hamiltonian cycle. In this article, we prove that any k-ary n-cube contains 2n mutually independent hamiltonian cycles. More specifically, let vi ∈...
متن کاملEecient Scatter Communication in Wormhole K-ary N-cubes with Multidestination Message Passing Eecient Scatter Communication in Wormhole K-ary N-cubes with Multidestination Message Passing 1
This paper presents eecient ways to implement one-to-all scatter communication on k-ary n-cubes with multidestination message-passing. Earlier researchers have applied multidestination message-passing to support non-personalized communications. In this paper, for the rst time in the literature, we demonstrate that multidestina-tion message-passing can also be used to support eecient personalize...
متن کاملAugmented k-ary n-cubes
We define an interconnection network AQn,k which we call the augmented kary n-cube by extending a k-ary n-cube in a manner analogous to the existing extension of an n-dimensional hypercube to an n-dimensional augmented cube. We prove that the augmented k-ary n-cube AQn,k has a number of attractive properties (in the context of parallel computing). For example, we show that the augmented k-ary n...
متن کاملHamiltonian circuit and linear array embeddings in faulty k-ary n-cubes
In this paper, we investigate the fault-tolerant capabilities of the k-ary n-cubes for even integer k with respect to the hamiltonian and hamiltonian-connected properties. The k-ary n-cube is a bipartite graph if and only if k is an even integer. Let F be a faulty set with nodes and/or links, and let k 3 be an odd integer. When |F | 2n−2, we show that there exists a hamiltonian cycle in a wound...
متن کاملk-ary n-cubes versus Fat Trees
In this paper, we examine performance aspects of fat-tree topologies and compare these to k-ary ncube topologies. In particular, we apply the analytic techniques developed for cube topologies upon fat trees to understand better the characteristic of that topology. The organization of this paper is as follows: Section 1 contains an overview of k-ary n-cube and fat-tree topologies. Section 2 cont...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2011
ISSN: 0166-218X
DOI: 10.1016/j.dam.2011.05.008